PiTSBiCG: Parallel in time Stable Bi-Conjugate gradient algorithm
نویسندگان
چکیده
This paper presents a new algorithm for the parallel in time (PiT) numerical simulation of dependent partial/ordinary differential equations. We propose reliable alternative to well know parareal algorithm, by formulating problem algebraically and solve it using an adapted Bi-Conjugate gradient stabilized method. The proposed Parallel Stable (PiTSBiCG short) has great potential stabilizing resolution variety problems. In this work, we describe mathematical approach provide evidence that shows its superiority standard
منابع مشابه
Parallel Implementation of a Generalized Conjugate Gradient Algorithm
This paper presents a parallel version of a Generalized Conjugate Gradient algorithm proposed by Liu and Story in which the search direction considers the effect of the inexact line search. We describe the implementation of this algorithm on a parallel architecture and analyze the related speedup ratios. Numerical results are given for a shared memory computer (Cray C92).
متن کاملSpace-time equalization using conjugate-gradient algorithm in WCDMA downlink
In the downlink of the Wideband Code Division Multiple-Access (WCDMA) system users are separated by means of Orthogonal Variable Spreading Factor codes. The orthogonality of the users is lost in multipath channels causing multiple access interference which limits the system capacity and the availability of high data rate services. To suppress the interference in the downlink, it has been propos...
متن کاملAn Efficient Conjugate Gradient Algorithm for Unconstrained Optimization Problems
In this paper, an efficient conjugate gradient method for unconstrained optimization is introduced. Parameters of the method are obtained by solving an optimization problem, and using a variant of the modified secant condition. The new conjugate gradient parameter benefits from function information as well as gradient information in each iteration. The proposed method has global convergence und...
متن کاملA new hybrid conjugate gradient algorithm for unconstrained optimization
In this paper, a new hybrid conjugate gradient algorithm is proposed for solving unconstrained optimization problems. This new method can generate sufficient descent directions unrelated to any line search. Moreover, the global convergence of the proposed method is proved under the Wolfe line search. Numerical experiments are also presented to show the efficiency of the proposed algorithm, espe...
متن کاملA Multipreconditioned Conjugate Gradient Algorithm
We propose a generalization of the conjugate gradient method that uses multiple preconditioners, combining them automatically in an optimal way. The derivation is described in detail, and analytical observations are made. A short recurrence relation does not hold in general for this new method, but in at least one case such a relation is satisfied: for two symmetric positive definite preconditi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Numerical Mathematics
سال: 2022
ISSN: ['1873-5460', '0168-9274']
DOI: https://doi.org/10.1016/j.apnum.2022.06.004